Constraint satisfaction problem with bilevel constraint: application to interpretation of over-segmented images
نویسندگان
چکیده
منابع مشابه
Constraint Satisfaction Problem with Bilevel Constraint: Application to Interpretation of Over-Segmented Images
In classical finite-domain constraint satisfaction problems, the assumption made is that only one value is associated with only one variable. For example, in pattern recognition one variable is associated with only one segmented region. However, in practice, regions are often oversegmented which results in failure of any one to one mapping. This paper proposes a definition of finite-domain cons...
متن کاملCSP(M): Constraint Satisfaction Problem over Models
Constraint satisfaction programming (CSP) has been successfully used in model-driven development (MDD) for solving a wide range of (combinatorial) problems. In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction pr...
متن کاملFuzzy constraint satisfaction problem for model-based image interpretation
Scene interpretation guided by a generic model benefits from structural representations of objects and their spatial relationships. In this paper, we consider nested conceptual graphs for encoding objects and groups of objects, spatial relationships between objects or between groups of objects, along with the imprecision and uncertainty attached to the formal representations of such relationshi...
متن کاملTrain Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem
The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...
متن کاملAn Approach to Multiply Segmented Constraint Satisfaction Problems
This paper describes an extension to the constraint satisfaction problem (CSP) approach called MUSE CSP (Multiply SEgmented Constraint Satisfaction Problem). This extension is especially useful for those problems which segment into multiple sets of partially shared variables. Such problems arise naturally in signal processing applications including computer vision, speech processing, and handwr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1997
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(97)00022-2